On super (a, d)-edge antimagic total labeling of certain families of graphs

نویسندگان

  • P. Roushini Leely Pushpam
  • A. Saibulla
چکیده

A (p, q)-graph G is (a, d)-edge antimagic total if there exists a bijection f : V (G) ∪ E(G) → {1, 2, . . . , p + q} such that the edge weights Λ(uv) = f(u) + f(uv) + f(v), uv ∈ E(G) form an arithmetic progression with first term a and common difference d. It is said to be a super (a, d)-edge antimagic total if the vertex labels are {1, 2, . . . , p} and the edge labels are {p+ 1, p+ 2, . . . , p + q}. In this paper, we study the super (a, d)-edge antimagic total labeling of special classes of graphs derived from copies of generalized ladder, fan, generalized prism and web graph.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Super (a, d)-edge antimagic total labelings of friendship graphs

An (a, d)-edge-antimagic total labeling of a graph G with p vertices and q edges is a bijection f from the set of all vertices and edges to the set of positive integers {1, 2, 3, . . . , p + q} such that all the edge-weights w(uv) = f(u) + f(v) + f(uv);uv ∈ E(G), form an arithmetic progression starting from a and having common difference d. An (a, d)-edgeantimagic total labeling is called a sup...

متن کامل

Super ( , - Edge - Antimagic Graphs

A graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a one-to-one and onto mapping f from ∪ , ,... , such that the edge weights , ∈ form an AP progression with first term ’a’ and common difference ’d’. The graph G is said to be Super (a,d)-edge-antimagic total labeling if the , , ... , . In this paper we obtain Super (a,d)-edge-antimagic properties of certain cla...

متن کامل

On super (a, d)-edge-antimagic total labeling of disconnected graphs

A graph G of order p and size q is called (a, d)-edge-antimagic total if there exists a bijection f : V(G) ∪ E(G) → {1, 2, . . . , p + q} such that the edge-weights, w(uv) = f(u) + f (v) + f (uv), uv ∈ E(G), form an arithmetic sequence with the first term a and common difference d. Such a graph G is called super if the smallest possible labels appear on the vertices. In this paper we study supe...

متن کامل

Super edge-antimagic labeling of a cycle with a chord

An (a, d)-edge-antimagic total labeling of G is a one-to-one mapping g taking the vertices and edges onto 1, 2, . . . , |V (G)| + |E(G)| so that the edgeweights w(uv) = g(u) + g(v) + g(uv), uv ∈ E(G), form an arithmetic progression with initial term a and common difference d. Such a labeling is called super if the smallest labels appear on the vertices. In this paper, we investigate the existen...

متن کامل

On super antimagic total labeling of Harary graph

This paper deals with two types of graph labelings namely, the super (a, d)-edge antimagic total labeling and super (a, d)-vertex antimagic total labeling on the Harary graph C n. We also construct the super edge-antimagic and super vertex-antimagic total labelings for a disjoint union of k identical copies of the Harary graph.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discussiones Mathematicae Graph Theory

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2012